Informed Detection Revisited
نویسندگان
چکیده
Watermarking systems can employ either informed detection, where the original cover work is required, or blind detection, where it is not required. While early systems used informed detection, recent work has focused on blind detection, because it is considered more challenging and general. Further, recent work on “dirty-paper watermarking” has suggested that informed detection provides no benefits over blind detection. This paper discusses the dirty-paper assumptions and questions whether they apply to real-world watermarking. We discuss three basic ways in which an informed video-watermark detector, developed at Sarnoff, uses the original work: canceling interference between the cover work and the watermark, canceling subsequent distortions, and tailoring the watermark to the perceptual characteristics of the source. Of these, only the first is addressed by theoretical work on dirty-paper watermarking. Whether the other two can be accomplished equally well with blind watermarking is an open question.
منابع مشابه
Cross-Linguistic Transfer Revisited: The Case of English and Persian
The present study sought to investigate the evidence for cross-linguistic transfer in a partial English immersion and non-immersion educational setting. To this end, a total of 145 first, third and fifth graders in a partial English immersion program and 95 students from the same grade levels in a non-immersion program were chosen. Six different English and Persian tests were administered: the ...
متن کاملUsability Testing: Revisiting Informed Consent procedures for testing Internet sites
This paper explores issues of professional, ethical conduct in usability testing centering around the concept of Ôinformed consentÕ. Previous work on informed consent has been in homogeneous geographic locations. With Internet sites being developed at a prodigious rate, these procedures need to be revisited for their applicability to heterogeneous locations, in terms of culture, business practi...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملThe function ring functors of pointfree topology revisited
This paper establishes two new connections between the familiar function ring functor ${mathfrak R}$ on the category ${bf CRFrm}$ of completely regular frames and the category {bf CR}${mathbf sigma}${bf Frm} of completely regular $sigma$-frames as well as their counterparts for the analogous functor ${mathfrak Z}$ on the category {bf ODFrm} of 0-dimensional frames, given by the integer-valued f...
متن کامل